منابع مشابه
Monadic Datalog Containment on Trees
We show that the query containment problem for monadic datalog on finite unranked labeled trees can be solved in 2-fold exponential time when (a) considering unordered trees using the axes child and descendant, and when (b) considering ordered trees using the axes firstchild, nextsibling, child, and descendant. When omitting the descendant-axis, we obtain that in both cases the problem is Expti...
متن کاملComputer virus prevention and containment on mainframes
A computer virus can be a vicious and insidious form of code. It has the ability to replicate itserf, to attach itself to other code, to spread through a computersystem or network, and often to initiate a harmful series of instructions when a "trigger" point b reached viruses can have a major impact on productivity because of the steadily increasing dependence of inahtrial, business, and govemm...
متن کاملOn the Containment Problem for Linear Sets
It is well known that the containment problem (as well as the equivalence problem) for semilinear sets is log-complete in Πp2. In this paper, we show that already the containment problem for linear sets is log-hard (and therefore also log-complete) in Πp2. This holds even when we use a unary encoding for the numerical input parameters or when we restrict the problem to 1-dimensional linear sets...
متن کاملA Short Note on Containment of Cores
We show that cores of ideals do not preserve the inclusion. Huneke and Swanson[2] raised the question of whether, given integrally closed ideals I ⊂ I ′ in a ring R, it is necessarily true that core(I) ⊂ core(I ). Hyry and Smith [4, Corollary 5.5.1] gave a partial answer. The purpose of this note is to show that the answer is no in general. Although the simplest counterexample is a principal id...
متن کاملOn the resemblance and containment of documents
Given two documents A and B we define two mathematical notions: their resemblance r(A,B) and their containment c(A,B) that seem to capture well the informal notions of “roughly the same” and “roughly contained.” The basic idea is to reduce these issues to set intersection problems that can be easily evaluated by a process of random sampling that can be done independently for each document. Furt...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Worldview
سال: 1982
ISSN: 0084-2559
DOI: 10.1017/s0084255900044405